|
Shmuel Gal ((ヘブライ語:שמואל גל)) is a mathematician and professor of statistics at the University of Haifa in Israel. He devised the Gal's accurate tables method for the computer evaluation of elementary functions. With Zvi Yehudai he developed in 1993 a new algorithm for sorting which is used by IBM. Gal has solved the Princess and monster game and made several significant contributions to the area of search games.〔S. Alpern and S. Gal (2003). ''The Theory of Search Games and Rendezvous'', Springer ISBN 0-7923-7468-1.〕 He has been working on rendezvous problems with his collaborative colleagues Steve Alpern, Vic Baston, and John Howard.〔S. Alpern and S. Gal (1995). Rendezvous Search on the Line with Distinguishable Players, SIAM J. Control and Optimization.〕〔V. Baston and S. Gal (1998). Rendezvous on the line when the players' initial distance is given by an unknown probability distribution, SIAM J. Control and Optimization.〕〔S. Alpern and S. Gal (2002). Searching for an Agent who may or may not Want to be Found, OPERATIONS RESEARCH.〕〔S. Gal and J. Howard (2005). Rendezvous-evasion search in two boxes, OPERATIONS RESEARCH.〕 Gal received a Ph.D. in mathematics from the Hebrew University of Jerusalem (thesis advisor: Aryeh Dvoretzky). ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Shmuel Gal」の詳細全文を読む スポンサード リンク
|